Variation analysis of semi-canonical process
نویسندگان
چکیده
منابع مشابه
Semi-paired Probabilistic Canonical Correlation Analysis
CCA is a powerful tool for analyzing paired multi-view data. However, when facing semi-paired multi-view data which widely exist in real-world problems, CCA usually performs poorly due to its requirement of data pairing between different views in nature. To cope with this problem, we propose a semi-paired variant of CCA named SemiPCCA based on the probabilistic model for CCA. Experiments with a...
متن کاملSemi-canonical binary matrices
In this paper, we define the concepts of semi-canonical and canonical binary matrix. Strictly mathematical, we prove the correctness of these definitions. We describe and we implement an algorithm for finding all n n × semi-canonical binary matrices taking into account the number of 1 in each of them. This problem relates to the combinatorial problem of finding all pairs of disjoint 2 2 n n × S...
متن کاملSemi-supervised Laplacian Regularization of Kernel Canonical Correlation Analysis
Kernel canonical correlation analysis (KCCA) is a dimensionality reduction technique for paired data. By finding directions that maximize correlation, KCCA learns representations that are more closely tied to the underlying semantics of the data rather than noise. However, meaningful directions are not only those that have high correlation to another modality, but also those that capture the ma...
متن کاملSemi-Supervised, Dimensionality Reduction via Canonical Correlation Analysis
We analyze the multi-view regression problemwhere we have two views (X1, X2) of the input data and a real target variable Y of interest. In a semi-supervised learning setting, we consider two separate assumptions (one based on redundancy and the other based on (de)correlation) and show how, under either assumption alone, dimensionality reduction (based on CCA) could reduce the labeled sample co...
متن کاملA Canonical Semi-Deterministic Transducer
We prove the existence of a canonical form for semi-deterministic transducers with sets of pairwise incomparable output strings. Based on this, we develop an algorithm which learns semi-deterministic transducers given access to translation queries. We also prove that there is no learning algorithm for semi-deterministic transducers that uses only domain knowledge.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical and Computer Modelling
سال: 2011
ISSN: 0895-7177
DOI: 10.1016/j.mcm.2011.01.028